A note on the complexity of the maximum edge clique partitioning problem with respect to the clique number
نویسندگان
چکیده
منابع مشابه
A note on the complexity of the maximum edge clique partitioning problem with respect to clique number
The maximum edge clique partitioning problem (Max-ECP) was considered by Dessmark et al. (2007) as a tool for DNA clone classification, and is known to be NP-hard on graphs with clique number 3. This complexity result was demonstrated by Punnen and Zhang (2012), however, their proof is incorrect. In this note, we give several complexity results of Max-ECP with respect to clique number, which in...
متن کاملThe maximum clique problem
In this paper we present a survey of results concerning algorithms, complexity, and applications of the maximum clique problem. We discuss enumerative and exact algorithms, heuristics, and a variety of other proposed methods. An up to date bibliography on the maximum clique and related problems is also provided.
متن کاملThe Maximum Clique Problem
Description Given an undirected graph G = ( V, E ), a clique S is a subset of V such that for any two elements u, v ∈ S, ( u, v ) ∈ E. Using the notation ES to represent the subset of edges which have both endpoints in clique S, the induced graph GS = ( S, ES ) is complete. Finding the largest clique in a graph is an NP-hard problem, called the maximum clique problem (MCP). Cliques are intimate...
متن کاملThe Maximum Edge Weight Clique Problem: Formulations and Solution Approaches
Given an edge-weighted graph, the maximum edge weight clique (MEWC) problem is to find a clique that maximizes the sum of edge weights within the corresponding complete subgraph. This problem generalizes the classical maximum clique problem and finds many real-world applications in molecular biology, broadband network design, pattern recognition and robotics, information retrieval, marketing, a...
متن کاملOn solving the maximum clique problem
Abstract. The Maximum Clique Problem (MCP) is regarded here as the maximization of an indefinite quadratic form over the canonical simplex. For solving MCP an algorithm based upon Global Optimality Conditions (GOC) is applied. Furthermore, each step of the algorithm is analytically investigated and tested. The computational results for the proposed algorithm are compared with other Global Searc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Optimization
سال: 2013
ISSN: 1572-5286
DOI: 10.1016/j.disopt.2013.08.004